The Brachistochrone Curve: the Problem of Quickest Descent
نویسندگان
چکیده
This article presents the problem of quickest descent, or the Brachistochrone curve, that may be solved by the calculus of variations and the Euler-Lagrange equation. The cycloid is the quickest curve and also has the property of isochronism by which Huygens improved on Galileo’s pendulum. AMS Subject Classification: 34A02, 00A09, 97A20
منابع مشابه
Isochrones and brachistochrones
Christiaan Huygens proved in 1659 that a particle sliding smoothly (under uniform gravity) on a cycloid with axis vertically down reaches the base in a period independent of the starting point. He built very accurate pendulum clocks, with cycloidal pendulums. Mark Denny has constructed another curve purported to give descent to the base in a period independent of the starting point; but the cyc...
متن کاملComplementary curves of descent
The shapes of two wires in a vertical plane with the same starting and ending points are described as complementary curves of descent if beads frictionlessly slide down both of them in the same time, starting from rest. Every analytic curve has a unique complement, except for a cycloid (solution of the brachistochrone problem), which is self complementary. A striking example is a straight wire ...
متن کاملEvolutionary Algorithms for Two Problems from the Calculus of Variations
A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose surface of revolution has minimum area. Two evolutionary algorithms find piecewise linear curves that closely approximate brachistochrones and catenaries. Two classic problems in the calculus of variations seek a brachistochro...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملA descent method for explicit computations on curves
It is shown that the knowledge of a surjective morphism $Xto Y$ of complex curves can be effectively used to make explicit calculations. The method is demonstrated by the calculation of $j(ntau)$ (for some small $n$) in terms of $j(tau)$ for the elliptic curve with period lattice $(1,tau)$, the period matrix for the Jacobian of a family of genus-$2$ curves complementing the classi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013